Infinitary Lambda Calculus Innnitary Lambda Calculus

In a previous paper we have established the theory of transsnite reduction for orthogonal term rewriting systems. In this paper we perform the same task for the lambda calculus. From the viewpoint of innnitary rewriting, the BB ohm model of the lambda calculus can be seen as an innnitary term model. In contrast to term rewriting, there are several diierent possible notions of innnite term, which give rise to diierent BB ohm-like models, which embody diierent notions of lazy or eager computation.